Spectral problem for quasi-uniform nearest-neighbor chains
نویسندگان
چکیده
منابع مشابه
Uniform-in-Bandwidth Nearest-Neighbor Density Estimation
We are concerned with the nonparametric estimation of the density f(·) of a random variable [rv] X ∈ R by the nearest-neighbor [NN] method. The NN estimators are motivated as follows (see, e.g., Fix and Hodges [17]). Let X1,X2, . . . be independent and identically distributed [iid] random copies of X, with distribution function [df] F(x) := P(X ≤ x), for x ∈ R. Denote the empirical df based upo...
متن کاملNearest neighbor conditional estimation for Harris recurrent Markov chains
This paper is concerned with consistent nearest neighbor time series estimation for data generated by a Harris recurrent Markov chain. The goal is to validate nearest neighbor estimation in this general time series context, using simple and weak conditions. The framework considered covers, in a unified manner, a wide variety of statistical quantities, e.g. autoregression function, conditional q...
متن کاملProblem Set 1 K-nearest Neighbor Classification
In this part, you will implement k-Nearest Neighbor (k-NN) algorithm on the 8scenes category dataset of Oliva and Torralba [1]. You are given a total of 800 labeled training images (containing 100 images for each class) and 1888 unlabeled testing images. Figure 1 shows some sample images from the data set. Your task is to analyze the performance of k-NN algorithm in classifying photographs into...
متن کاملApproximate Nearest Neighbor Problem in High Dimensions
We investigate the problem of finding the approximate nearest neighbor when the data set points are the substrings of a given text T . The exact version of this problem is defined as follows. Given a text T of length n, we want to build a data structure that supports the following operation: given a pattern P , find the substring of T that is the closest to P . Since the exact version of this p...
متن کاملKinetic Reverse k-Nearest Neighbor Problem
This paper provides the first solution to the kinetic reverse k-nearest neighbor (RkNN) problem in R, which is defined as follows: Given a set P of n moving points in arbitrary but fixed dimension d, an integer k, and a query point q / ∈ P at any time t, report all the points p ∈ P for which q is one of the k-nearest neighbors of p.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 2013
ISSN: 0022-2488,1089-7658
DOI: 10.1063/1.4797477